AI029
Reinforcement Learning: An Introduction
Dynamic Programming
Learning Objectives
- Identify problems that exhibit optimal substructure and overlapping subproblems.
- Implement top-down solutions using memoization.
- Develop bottom-up solutions using tabulation.
- Analyze time and space complexity of dynamic programming algorithms.
- Apply DP techniques to classic problems like the Knapsack and Longest Common Subsequence.